Design issues in distributed searching of multi-dimensional data
نویسندگان
چکیده
In this paper we discuss some design issues concerning a semi-dynamic data structure for searching in multidimensional point sets in distributed environments. The data structure is based on an extension of k-d trees and supports exact, partial, and range search queries. We assume multicast is available in our distributed environment, but discuss how to use it only when needed and investigate, through a cost-model, the best strategy to deal with range queries.
منابع مشابه
Effective Design of a 3×4 Two Dimensional Distributed Amplifier Based on Gate Line Considerations
In this paper two dimensional wave propagation is used for power combining in drain nodes of a distributed amplifier (DA). The proposed two dimensional DA uses an electrical funnel to add the currents of drain nodes. The proposed structure is modified due to gate lines considerations. Total gain improvement is achieved by engineering the characteristic impedance of gate lines and also make appr...
متن کاملScalable Distributed Data Structures: A Survey
This paper reviews literature on scalable data structures for searching in a distributed computing environment. Starting with a system where one server manages a file of a given size that is accessed by a specific number of clients at a specific rate, a scalable distributed data structures (SDDS) can efficiently manage a file that is n times bigger and accessed by n times more clients at the sa...
متن کاملDistributed Searching of Multi-dimensional Data: A Performance Evaluation Study
In this paper we present a data structure for searching in multi-dimensional point sets in distributed environments and discuss its experimental evaluation also through a comparison with previous proposals. The data structure is based on an extension of k-d trees. The technological reference context is a distributed environment where multicast (i.e., restricted broadcast) is allowed, but it is ...
متن کاملSearching and Tracking for Multi-Robot Observation of Moving Targets
Searching and tracking are important issues in multi-robot observation of multiple moving targets. In this paper, our distributed memory based searching and artificial potential field based tracking algorithms are presented. For searching, a memory table, either local or shared, helps to find targets. For tracking, an artificial potential field based motion control algorithm provides real-time ...
متن کاملA Framework for Multilingual Searching and Meta-information Extraction
Due in large part to the popularity and global nature of the Web, multi-lingual issues in computers is finally beginning to attract serious attention, from users and developers alike. At the Software Labs in NTT, we are involved in a project that confronts multi-lingual issues in a big way. Namely, we are building software designed to self-configure a global distributed search infrastructure. T...
متن کامل